Term Partitions and Minimal Generalizations of Clauses
نویسنده
چکیده
Term occurrences of any clause C are determined by their positions. The set of all term partitions defined on subsets of term occurrences of C form a partially ordered set. This poset is isomorphic to the set of all generalizations of C. The structure of this poset can be inferred from the term occurrences in C alone. We can apply these constructions in this poset in machine learning.
منابع مشابه
The V- and W-operators in Inverse Resolutions
Resolutions are often used to conclude results from given clauses. In machine learning we need sometimes to consider some given facts as results of some clauses and we want to find these clauses. This is the backgrond of inverse resolution. Muggleton and Buntine[1] have defined Vand Woperators for inverse resolutions in 1988. They have also implemented them in a system CIGOL. These two operator...
متن کاملDecidability Results for Saturation-Based Model Building
Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termination without generating an empty clause, a saturated clause set implicitly represents a minimal model for all clauses, based on the underlying term ordering of the superposition calculus. In general, it is not decidable wheth...
متن کاملPac-Learning Non-Recursive Prolog Clauses
Recently there has been an increasing amount of research on learning concepts expressed in subsets of Prolog; the term inductive logic programming (ILP) has been used to describe this growing body of research. This paper seeks to expand the theoretical foundations of ILP by investigating the pac-learnability of logic programs. We focus on programs consisting of a single function-free non-recurs...
متن کاملLeast Generalizations under Implication
One of the most prominent approaches in Inductive Logic Programming is the use of least generalizations under subsumption of given clauses. However, subsumption is weaker than logical implication, and not very well suited for handling recursive clauses. Therefore an important open question in this area concerns the existence of least generalizations under implication (LGIs). Our main new result...
متن کاملThe Subsumption Lattice and Query Learning
The paper identifies several new properties of the lattice induced by the subsumption relation over first-order clauses and derives implications of these for learnability. In particular, it is shown that the length of subsumption chains of function free clauses with bounded size can be exponential in the size. This suggests that simple algorithmic approaches that rely on repeating minimal subsu...
متن کامل